Strategy-proof house allocation with price restrictions
نویسندگان
چکیده
This paper considers a house allocation problem with no initial ownership and where prices are bounded from below and above by exogenously given price restrictions. This type of housing market contains, e.g., the “assignment market” and the “student placement problem” as special cases. A mechanism called the minimal RPE mechanism is defined, and two main results are obtained. First, it is demonstrated that the mechanism is manipulable at some profile in the full preference domain R. Second, it is proved that there is a subset R̃ ⊂ R of the full domain, containing almost all profiles in R, such that the minimal RPE mechanism is strategy-proof in that subset. JEL Classification: C78; D71.
منابع مشابه
House Allocation with Transfers
We consider the Shapley-Scarf house allocation problem where monetary transfers are allowed. We characterize the class of mechanisms that are strategy-proof, ex post individually rational, ex post budget balanced, and “collusion-proof.” In these mechanisms, the price of each object is fixed in advance, and the objects are reallocated according to the (unique) core assignment of the Shapley-Scar...
متن کاملA Theory of House Allocation and Exchange Mechanisms∗
We study the allocation and exchange of indivisible objects without monetary transfers. In market design literature, some problems that fall in this category are the house allocation problem with and without existing tenants, and the kidney exchange problem. We introduce a new class of direct mechanisms that we call "trading cycles with brokers and owners," and show that (i) each mechanism in t...
متن کاملConsistent strategy-proof assignment by hierarchical exchange
We characterize the family of efficient, consistent, and strategy-proof rules in house allocation problems. These rules follow an endowment inheritance and trade procedure as in Pápai’s Hierarchical Exchange rules [Pápai, S., 2000. Strategy-proof assignment by hierarchical exchange, Econometrica 68, 1403-1433] and closely resemble Ergin’s Priority Rules [Ergin, H., 2002. Efficient resource allo...
متن کاملStrategy-Proofness and the Core in House Allocation Problems
We study house allocation problems introduced by Shapley and Scarf (1974). We prove that a mechanism (a social choice function) is individually rational, anonymous, strategy-proof, and non-bossy (but not necessarily Pareto efficient) if and only if it is either the core mechanism or the no-trade mechanism, where the no-trade mechanism is the one that selects the initial allocation for each prof...
متن کاملStrategy-proof tie-breaking in matching with priorities∗
A set of indivisible objects is allocated among agents with strict preferences. Each object has a weak priority ranking of the agents. A collection of priority rankings, a priority structure, is solvable if there is a strategy-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another stable matching. We characterize all so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 163 شماره
صفحات -
تاریخ انتشار 2016